2-designs having an intersection number k − n
نویسندگان
چکیده
منابع مشابه
Quasi-symmetric 3-designs with a fixed block intersection number
Quasi-symmetric 3-designs with block intersection numbers x, y (0 ≤ x ≤ y < k) are studied. It is proved that the parameter λ of a quasi-symmetric 3-(v, k, λ) design satisfies a quadratic whose coefficients are polynomial functions of k, x and y. We use this quadratic to prove that there exist finitely many quasi-symmetric 3-designs under either of the following two restrictions: 1. The block i...
متن کاملGraphs Having Small Number of Sizes on Induced k-Subgraphs
Let ` be any positive integer, n be a sufficiently large number, and let G be a graph on n vertices. Define for any k νk(G) = |{|E(H)| : H is an induced subgraph of G on k vertices}|. We show that if 2` ≤ k ≤ n−2` and νk(G) ≤ ` then G has a complete or an empty subgraph on at least n − ` + 1 vertices, and a homogeneous set of order at least n − 2` + 2. These results are sharp.
متن کاملPROJECTIVE ( 2 n , n , A , I ) - DESIGNS
A projective (2~ n, L, I)-design is a set 9 of n element subsets (called blocks) of a 2nelement set V having the properties that each element of V is a member of 1 blocks and every two blocks have a non-empty intersection. This paper establishes existence and non-existence results for various projective (2n, n, rl, I)-designs and their subdesigns. AMS (MOS) Subject Classifications: Primary 05B0...
متن کاملSilver Block Intersection Graphs of Steiner 2-Designs
For a block design D, a series of block intersection graphs Gi, or i-BIG(D), i = 0, . . . , k is defined in which the vertices are the blocks of D, with two vertices adjacent if and only if the corresponding blocks intersect in exactly i elements. A silver graph G is defined with respect to a maximum independent set of G, called an α-set. Let G be an r-regular graph and c be a proper (r + 1)-co...
متن کاملDoubly homogeneous 2-(v, k, 1) designs
A 2-(v, k, 1) design 9 = (S, 93) is a finite set S of u points and a collection $3 of k-subsets of S, called blocks, such that any 2-subset of S is contained in precisely one block. We will always assume that 2 <k < o. Let G d Aut 9 be a group of automorphisms of a 2-(u, k, 1) design 9. Those designs $3 for which G acts doubly transitively on the points have been classified by Kantor [6] and, f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1980
ISSN: 0097-3165
DOI: 10.1016/0097-3165(80)90059-x